0.06/0.10 % Problem : SLH521^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.11 % Command : run_E %s %d THM 0.11/0.32 % Computer : n021.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 30 0.11/0.32 % WCLimit : 30 0.11/0.32 % DateTime : Tue Aug 9 03:04:20 EDT 2022 0.11/0.32 % CPUTime : 0.16/0.43 The problem SPC is TH0_THM_EQU_NAR 0.16/0.43 Running higher-order on 1 cores theorem proving 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.16/0.43 # Version: 3.0pre003-ho 0.34/0.61 # Preprocessing class: HSLSSMSSSSMNHFA. 0.34/0.61 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.34/0.61 # Starting pre_casc_2 with 30s (1) cores 0.34/0.61 # pre_casc_2 with pid 22898 completed with status 0 0.34/0.61 # Result found by pre_casc_2 0.34/0.61 # Preprocessing class: HSLSSMSSSSMNHFA. 0.34/0.61 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.34/0.61 # Starting pre_casc_2 with 30s (1) cores 0.34/0.61 # No SInE strategy applied 0.34/0.61 # Search class: HGHSM-FSLM31-MHFFFSBN 0.34/0.61 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.34/0.61 # Starting new_ho_10 with 17s (1) cores 0.34/0.61 # new_ho_10 with pid 22899 completed with status 0 0.34/0.61 # Result found by new_ho_10 0.34/0.61 # Preprocessing class: HSLSSMSSSSMNHFA. 0.34/0.61 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.34/0.61 # Starting pre_casc_2 with 30s (1) cores 0.34/0.61 # No SInE strategy applied 0.34/0.61 # Search class: HGHSM-FSLM31-MHFFFSBN 0.34/0.61 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.34/0.61 # Starting new_ho_10 with 17s (1) cores 0.34/0.61 # Preprocessing time : 0.006 s 0.34/0.61 # Presaturation interreduction done 0.34/0.61 0.34/0.61 # Proof found! 0.34/0.61 # SZS status Theorem 0.34/0.61 # SZS output start CNFRefutation 0.34/0.61 thf(decl_22, type, condit1627435690bove_a: (a > a > $o) > set_a > $o). 0.34/0.61 thf(decl_23, type, condit1001553558elow_a: (a > a > $o) > set_a > $o). 0.34/0.61 thf(decl_24, type, finite1234128689_set_a: (a > set_a > set_a) > $o). 0.34/0.61 thf(decl_25, type, finite746615249te_a_a: (a > a > a) > $o). 0.34/0.61 thf(decl_26, type, finite964917804_set_a: (a > set_a > set_a) > $o). 0.34/0.61 thf(decl_27, type, finite40241356em_a_a: (a > a > a) > $o). 0.34/0.61 thf(decl_28, type, finite398586959_set_a: (a > set_a > set_a) > $o). 0.34/0.61 thf(decl_29, type, finite19304175ms_a_a: (a > a > a) > $o). 0.34/0.61 thf(decl_30, type, finite_finite_set_a: set_set_a > $o). 0.34/0.61 thf(decl_31, type, finite_finite_a: set_a > $o). 0.34/0.61 thf(decl_32, type, abel_semigroup_a: (a > a > a) > $o). 0.34/0.61 thf(decl_33, type, abel_s2117090225ioms_a: (a > a > a) > $o). 0.34/0.61 thf(decl_34, type, semigroup_a: (a > a > a) > $o). 0.34/0.61 thf(decl_35, type, semilattice_a: (a > a > a) > $o). 0.34/0.61 thf(decl_36, type, semilattice_axioms_a: (a > a > a) > $o). 0.34/0.61 thf(decl_37, type, lattic247676691_fin_a: (a > a > a) > set_a > a). 0.34/0.61 thf(decl_38, type, lattic1885654924_set_a: (a > a > a) > $o). 0.34/0.61 thf(decl_39, type, lattic1781219155_fin_a: (a > a > a) > set_a > a). 0.34/0.61 thf(decl_40, type, modula17988509_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.34/0.61 thf(decl_41, type, modula1373251614_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.34/0.61 thf(decl_42, type, modula581031071_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.34/0.61 thf(decl_43, type, modula1936294176_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.34/0.61 thf(decl_44, type, modula1144073633_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.34/0.61 thf(decl_45, type, modula1727524044comp_a: (a > a > $o) > a > a > $o). 0.34/0.61 thf(decl_46, type, bot_bot_set_set_a: set_set_a). 0.34/0.61 thf(decl_47, type, bot_bot_set_a: set_a). 0.34/0.61 thf(decl_48, type, least_a: (a > a > $o) > (a > $o) > a). 0.34/0.61 thf(decl_49, type, max_a: (a > a > $o) > a > a > a). 0.34/0.61 thf(decl_50, type, min_a: (a > a > $o) > a > a > a). 0.34/0.61 thf(decl_51, type, ord_le318720350_set_a: set_set_a > set_set_a > $o). 0.34/0.61 thf(decl_52, type, ord_less_eq_set_a: set_a > set_a > $o). 0.34/0.61 thf(decl_53, type, greatest_a: (a > a > $o) > (a > $o) > a). 0.34/0.61 thf(decl_54, type, antimono_a_set_a: (a > a > $o) > (a > set_a) > $o). 0.34/0.61 thf(decl_55, type, mono_a_set_a: (a > a > $o) > (a > set_a) > $o). 0.34/0.61 thf(decl_56, type, transp_a: (a > a > $o) > $o). 0.34/0.61 thf(decl_57, type, collect_set_a: (set_a > $o) > set_set_a). 0.34/0.61 thf(decl_58, type, collect_a: (a > $o) > set_a). 0.34/0.61 thf(decl_59, type, insert_set_a: set_a > set_set_a > set_set_a). 0.34/0.61 thf(decl_60, type, insert_a: a > set_a > set_a). 0.34/0.61 thf(decl_61, type, set_atLeast_a: (a > a > $o) > a > set_a). 0.34/0.61 thf(decl_62, type, set_atMost_a: (a > a > $o) > a > set_a). 0.34/0.61 thf(decl_63, type, member_set_a: set_a > set_set_a > $o). 0.34/0.61 thf(decl_64, type, member_a: a > set_a > $o). 0.34/0.61 thf(decl_65, type, a2: a). 0.34/0.61 thf(decl_66, type, b: a). 0.34/0.61 thf(decl_67, type, c: a). 0.34/0.61 thf(decl_68, type, inf: a > a > a). 0.34/0.61 thf(decl_69, type, less_eq: a > a > $o). 0.34/0.61 thf(decl_70, type, sup: a > a > a). 0.34/0.61 thf(decl_71, type, esk1_0: a). 0.34/0.61 thf(decl_72, type, esk2_0: a). 0.34/0.61 thf(decl_73, type, esk3_0: a). 0.34/0.61 thf(decl_74, type, esk4_0: a). 0.34/0.61 thf(decl_75, type, esk5_0: a). 0.34/0.61 thf(decl_76, type, esk6_0: a). 0.34/0.61 thf(decl_77, type, esk7_2: (a > $o) > (a > $o) > a). 0.34/0.61 thf(decl_78, type, esk8_1: (a > a > a) > a). 0.34/0.61 thf(decl_79, type, esk9_1: (a > a > a) > a). 0.34/0.61 thf(decl_80, type, esk10_1: (a > a > a) > a). 0.34/0.61 thf(decl_81, type, esk11_1: (a > a > a) > a). 0.34/0.61 thf(decl_82, type, esk12_1: (a > a > a) > a). 0.34/0.61 thf(decl_83, type, esk13_1: (a > a > a) > a). 0.34/0.61 thf(decl_84, type, esk14_1: (a > a > a) > a). 0.34/0.61 thf(decl_85, type, esk15_1: (a > a > a) > a). 0.34/0.61 thf(decl_86, type, esk16_1: (a > a > a) > a). 0.34/0.61 thf(decl_87, type, esk17_1: (a > a > a) > a). 0.34/0.61 thf(decl_88, type, esk18_1: (a > a > a) > a). 0.34/0.61 thf(decl_89, type, esk19_1: (a > a > a) > a). 0.34/0.61 thf(decl_90, type, esk20_1: (a > a > a) > a). 0.34/0.61 thf(decl_91, type, esk21_1: (a > a > a) > a). 0.34/0.61 thf(decl_92, type, esk22_1: (a > a > a) > a). 0.34/0.61 thf(decl_93, type, esk23_1: (a > a > a) > a). 0.34/0.61 thf(decl_94, type, esk24_1: (a > a > a) > a). 0.34/0.61 thf(decl_95, type, esk25_1: (a > a > a) > a). 0.34/0.61 thf(decl_96, type, esk26_1: (a > a > a) > a). 0.34/0.61 thf(decl_97, type, esk27_1: (a > a > a) > a). 0.34/0.61 thf(decl_98, type, esk28_1: (a > a > a) > a). 0.34/0.61 thf(decl_99, type, esk29_1: (a > a > a) > a). 0.34/0.61 thf(decl_100, type, esk30_1: (a > a > a) > a). 0.34/0.61 thf(decl_101, type, esk31_1: (a > a > a) > a). 0.34/0.61 thf(decl_102, type, esk32_2: (a > $o) > a > a). 0.34/0.61 thf(decl_103, type, esk33_3: (a > $o) > a > (a > $o) > a). 0.34/0.61 thf(decl_104, type, esk34_2: (a > $o) > a > a). 0.34/0.61 thf(decl_105, type, esk35_2: (a > $o) > a > a). 0.34/0.61 thf(decl_106, type, esk36_2: (a > $o) > a > a). 0.34/0.61 thf(decl_107, type, esk37_2: (a > $o) > a > a). 0.34/0.61 thf(decl_108, type, esk38_2: (a > $o) > a > a). 0.34/0.61 thf(decl_109, type, esk39_2: (a > $o) > a > a). 0.34/0.61 thf(decl_110, type, esk40_3: (a > $o) > a > (a > $o) > a). 0.34/0.61 thf(decl_111, type, esk41_2: (a > $o) > a > a). 0.34/0.61 thf(decl_112, type, esk42_1: (a > a > a) > a). 0.34/0.61 thf(decl_113, type, esk43_1: (a > a > a) > a). 0.34/0.61 thf(decl_114, type, esk44_1: set_a > a). 0.34/0.61 thf(decl_115, type, esk45_2: set_a > a > a). 0.34/0.61 thf(decl_116, type, esk46_1: set_a > a). 0.34/0.61 thf(decl_117, type, esk47_2: set_a > a > a). 0.34/0.61 thf(decl_118, type, esk48_2: set_a > a > a). 0.34/0.61 thf(decl_119, type, esk49_2: set_a > a > a). 0.34/0.61 thf(decl_120, type, esk50_2: set_a > a > a). 0.34/0.61 thf(decl_121, type, esk51_2: set_a > a > a). 0.34/0.61 thf(decl_122, type, esk52_1: set_a > a). 0.34/0.61 thf(decl_123, type, esk53_1: set_a > a). 0.34/0.61 thf(decl_124, type, esk54_2: set_a > a > a). 0.34/0.61 thf(decl_125, type, esk55_2: set_a > a > a). 0.34/0.61 thf(decl_126, type, esk56_2: set_a > a > a). 0.34/0.61 thf(decl_127, type, esk57_2: set_a > a > a). 0.34/0.61 thf(decl_128, type, esk58_1: (a > set_a) > a). 0.34/0.61 thf(decl_129, type, esk59_1: (a > set_a) > a). 0.34/0.61 thf(decl_130, type, esk60_1: (a > set_a) > a). 0.34/0.61 thf(decl_131, type, esk61_1: (a > set_a) > a). 0.34/0.61 thf(decl_132, type, esk62_1: (a > set_a) > a). 0.34/0.61 thf(decl_133, type, esk63_1: (a > set_a) > a). 0.34/0.61 thf(decl_134, type, esk64_1: (a > set_a) > a). 0.34/0.61 thf(decl_135, type, esk65_1: (a > set_a) > a). 0.34/0.61 thf(decl_136, type, esk66_1: set_set_a > set_a). 0.34/0.61 thf(decl_137, type, esk67_1: set_set_a > set_a). 0.34/0.61 thf(decl_138, type, esk68_2: set_set_a > set_a > set_a). 0.34/0.61 thf(decl_139, type, esk69_2: set_set_a > set_a > set_a). 0.34/0.61 thf(decl_140, type, esk70_1: set_a > a). 0.34/0.61 thf(decl_141, type, esk71_1: set_a > a). 0.34/0.61 thf(decl_142, type, esk72_1: set_a > a). 0.34/0.61 thf(decl_143, type, esk73_1: set_a > a). 0.34/0.61 thf(decl_144, type, esk74_1: (set_set_a > $o) > set_set_a). 0.34/0.61 thf(decl_145, type, esk75_1: (set_set_a > $o) > set_a). 0.34/0.61 thf(decl_146, type, esk76_1: (set_set_a > $o) > set_set_a). 0.34/0.61 thf(decl_147, type, esk77_1: (set_a > $o) > set_a). 0.34/0.61 thf(decl_148, type, esk78_1: (set_a > $o) > a). 0.34/0.61 thf(decl_149, type, esk79_1: (set_a > $o) > set_a). 0.34/0.61 thf(decl_150, type, esk80_2: set_set_a > (set_set_a > $o) > set_a). 0.34/0.61 thf(decl_151, type, esk81_2: set_set_a > (set_set_a > $o) > set_a). 0.34/0.61 thf(decl_152, type, esk82_2: set_set_a > (set_set_a > $o) > set_set_a). 0.34/0.61 thf(decl_153, type, esk83_2: set_a > (set_a > $o) > a). 0.34/0.61 thf(decl_154, type, esk84_2: set_a > (set_a > $o) > a). 0.34/0.61 thf(decl_155, type, esk85_2: set_a > (set_a > $o) > set_a). 0.34/0.61 thf(decl_156, type, esk86_2: set_set_a > (set_set_a > $o) > set_set_a). 0.34/0.61 thf(decl_157, type, esk87_2: set_set_a > (set_set_a > $o) > set_a). 0.34/0.61 thf(decl_158, type, esk88_2: set_a > (set_a > $o) > set_a). 0.34/0.61 thf(decl_159, type, esk89_2: set_a > (set_a > $o) > a). 0.34/0.61 thf(decl_160, type, esk90_2: set_set_a > (set_set_a > $o) > set_a). 0.34/0.61 thf(decl_161, type, esk91_2: set_set_a > (set_set_a > $o) > set_set_a). 0.34/0.61 thf(decl_162, type, esk92_2: set_a > (set_a > $o) > a). 0.34/0.61 thf(decl_163, type, esk93_2: set_a > (set_a > $o) > set_a). 0.34/0.61 thf(decl_164, type, esk94_1: set_set_a > set_set_a). 0.34/0.61 thf(decl_165, type, esk95_1: set_set_a > set_a). 0.34/0.61 thf(decl_166, type, esk96_1: set_a > set_a). 0.34/0.61 thf(decl_167, type, esk97_1: set_a > a). 0.34/0.61 thf(decl_168, type, esk98_1: set_set_a > set_set_a). 0.34/0.61 thf(decl_169, type, esk99_1: set_set_a > set_a). 0.34/0.61 thf(decl_170, type, esk100_1: set_a > set_a). 0.34/0.61 thf(decl_171, type, esk101_1: set_a > a). 0.34/0.61 thf(decl_172, type, epred1_1: set_set_a > set_a > $o). 0.34/0.61 thf(decl_173, type, epred2_1: set_a > a > $o). 0.34/0.61 thf(conj_0, conjecture, ((inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ b @ c)))=(sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ a2 @ (inf @ b @ c)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.34/0.61 thf(fact_29_calculation, axiom, ((inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))=(inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ b @ c)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_29_calculation)). 0.34/0.61 thf(fact_7_local_Osup_Ocommute, axiom, ![X1:a, X2:a]:(((sup @ X1 @ X2)=(sup @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_7_local_Osup_Ocommute)). 0.34/0.61 thf(fact_1_local_Oinf_Ocommute, axiom, ![X1:a, X2:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_local_Oinf_Ocommute)). 0.34/0.61 thf(fact_8_local_Osup_Oleft__commute, axiom, ![X2:a, X1:a, X3:a]:(((sup @ X2 @ (sup @ X1 @ X3))=(sup @ X1 @ (sup @ X2 @ X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_8_local_Osup_Oleft__commute)). 0.34/0.61 thf(fact_90_local_Omodular, axiom, ![X4:a, X5:a, X6:a]:(((less_eq @ X4 @ X5)=>((sup @ X4 @ (inf @ X5 @ X6))=(inf @ X5 @ (sup @ X4 @ X6))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_90_local_Omodular)). 0.34/0.61 thf(fact_114_local_Oinf__le1, axiom, ![X4:a, X5:a]:((less_eq @ (inf @ X4 @ X5) @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_114_local_Oinf__le1)). 0.34/0.61 thf(fact_28__092_060open_062a_A_092_060sqinter_062_Ad__aux_Aa_Ab_Ac_A_061_Aa_A_092_060sqinter_062_A_Ia_A_092_060sqinter_062_Ab_A_092_060squnion_062_Ab_A_092_060sqinter_062_Ac_A_092_060squnion_062_Ac_A_092_060sqinter_062_Aa_J_092_060close_062, axiom, ((inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))=(inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ b @ c)) @ (inf @ c @ a2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_28__092_060open_062a_A_092_060sqinter_062_Ad__aux_Aa_Ab_Ac_A_061_Aa_A_092_060sqinter_062_A_Ia_A_092_060sqinter_062_Ab_A_092_060squnion_062_Ab_A_092_060sqinter_062_Ac_A_092_060squnion_062_Ac_A_092_060sqinter_062_Aa_J_092_060close_062)). 0.34/0.61 thf(c_0_8, negated_conjecture, ((inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ b @ c)))!=(sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ a2 @ (inf @ b @ c)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.34/0.61 thf(c_0_9, negated_conjecture, ((inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ b @ c)))!=(sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ a2 @ (inf @ b @ c)))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.34/0.61 thf(c_0_10, plain, ((inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))=(inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ b @ c)))), inference(split_conjunct,[status(thm)],[fact_29_calculation])). 0.34/0.61 thf(c_0_11, plain, ![X818:a, X819:a]:(((sup @ X818 @ X819)=(sup @ X819 @ X818))), inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute])). 0.34/0.61 thf(c_0_12, plain, ![X802:a, X803:a]:(((inf @ X802 @ X803)=(inf @ X803 @ X802))), inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute])). 0.34/0.61 thf(c_0_13, negated_conjecture, ((sup @ (sup @ (inf @ a2 @ b) @ (inf @ c @ a2)) @ (inf @ a2 @ (inf @ b @ c)))!=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(rw,[status(thm)],[c_0_9, c_0_10])). 0.34/0.61 thf(c_0_14, plain, ![X2:a, X1:a]:(((sup @ X1 @ X2)=(sup @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.34/0.61 thf(c_0_15, plain, ![X2:a, X1:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.34/0.61 thf(c_0_16, plain, ![X820:a, X821:a, X822:a]:(((sup @ X820 @ (sup @ X821 @ X822))=(sup @ X821 @ (sup @ X820 @ X822)))), inference(variable_rename,[status(thm)],[fact_8_local_Osup_Oleft__commute])). 0.34/0.61 thf(c_0_17, negated_conjecture, ((sup @ (inf @ a2 @ (inf @ b @ c)) @ (sup @ (inf @ a2 @ b) @ (inf @ a2 @ c)))!=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_15])). 0.34/0.61 thf(c_0_18, plain, ![X1:a, X2:a, X3:a]:(((sup @ X1 @ (sup @ X2 @ X3))=(sup @ X2 @ (sup @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.34/0.61 thf(c_0_19, plain, ![X983:a, X984:a, X985:a]:((~(less_eq @ X983 @ X984)|((sup @ X983 @ (inf @ X984 @ X985))=(inf @ X984 @ (sup @ X983 @ X985))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_90_local_Omodular])])). 0.34/0.61 thf(c_0_20, plain, ![X1049:a, X1050:a]:((less_eq @ (inf @ X1049 @ X1050) @ X1049)), inference(variable_rename,[status(thm)],[fact_114_local_Oinf__le1])). 0.34/0.61 thf(c_0_21, plain, ((inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))=(inf @ a2 @ (sup @ (sup @ (inf @ a2 @ b) @ (inf @ b @ c)) @ (inf @ c @ a2)))), inference(split_conjunct,[status(thm)],[fact_28__092_060open_062a_A_092_060sqinter_062_Ad__aux_Aa_Ab_Ac_A_061_Aa_A_092_060sqinter_062_A_Ia_A_092_060sqinter_062_Ab_A_092_060squnion_062_Ab_A_092_060sqinter_062_Ac_A_092_060squnion_062_Ac_A_092_060sqinter_062_Aa_J_092_060close_062])). 0.34/0.61 thf(c_0_22, negated_conjecture, ((sup @ (inf @ a2 @ b) @ (sup @ (inf @ a2 @ c) @ (inf @ a2 @ (inf @ b @ c))))!=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18]), c_0_14])). 0.34/0.61 thf(c_0_23, plain, ![X1:a, X3:a, X2:a]:((((sup @ X1 @ (inf @ X2 @ X3))=(inf @ X2 @ (sup @ X1 @ X3)))|~((less_eq @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_19])). 0.34/0.61 thf(c_0_24, plain, ![X2:a, X1:a]:((less_eq @ (inf @ X1 @ X2) @ X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.34/0.61 thf(c_0_25, plain, ((inf @ a2 @ (sup @ (inf @ a2 @ c) @ (sup @ (inf @ a2 @ b) @ (inf @ b @ c))))=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_14]), c_0_15])). 0.34/0.61 thf(c_0_26, negated_conjecture, ((sup @ (inf @ a2 @ b) @ (inf @ a2 @ (sup @ (inf @ a2 @ c) @ (inf @ b @ c))))!=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])])). 0.34/0.61 thf(c_0_27, plain, ((inf @ a2 @ (sup @ (inf @ a2 @ b) @ (sup @ (inf @ a2 @ c) @ (inf @ b @ c))))=(inf @ a2 @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c))), inference(rw,[status(thm)],[c_0_25, c_0_18])). 0.34/0.61 thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_23]), c_0_27]), c_0_24])]), ['proof']). 0.34/0.61 # SZS output end CNFRefutation 0.34/0.61 # Parsed axioms : 325 0.34/0.61 # Removed by relevancy pruning/SinE : 0 0.34/0.61 # Initial clauses : 476 0.34/0.61 # Removed in clause preprocessing : 63 0.34/0.61 # Initial clauses in saturation : 413 0.34/0.61 # Processed clauses : 975 0.34/0.61 # ...of these trivial : 56 0.34/0.61 # ...subsumed : 210 0.34/0.61 # ...remaining for further processing : 709 0.34/0.61 # Other redundant clauses eliminated : 21 0.34/0.61 # Clauses deleted for lack of memory : 0 0.34/0.61 # Backward-subsumed : 27 0.34/0.61 # Backward-rewritten : 9 0.34/0.61 # Generated clauses : 4260 0.34/0.61 # ...of the previous two non-redundant : 3580 0.34/0.61 # ...aggressively subsumed : 0 0.34/0.61 # Contextual simplify-reflections : 3 0.34/0.61 # Paramodulations : 4198 0.34/0.61 # Factorizations : 2 0.34/0.61 # NegExts : 0 0.34/0.61 # Equation resolutions : 21 0.34/0.61 # Propositional unsat checks : 0 0.34/0.61 # Propositional check models : 0 0.34/0.61 # Propositional check unsatisfiable : 0 0.34/0.61 # Propositional clauses : 0 0.34/0.61 # Propositional clauses after purity: 0 0.34/0.61 # Propositional unsat core size : 0 0.34/0.61 # Propositional preprocessing time : 0.000 0.34/0.61 # Propositional encoding time : 0.000 0.34/0.61 # Propositional solver time : 0.000 0.34/0.61 # Success case prop preproc time : 0.000 0.34/0.61 # Success case prop encoding time : 0.000 0.34/0.61 # Success case prop solver time : 0.000 0.34/0.61 # Current number of processed clauses : 359 0.34/0.61 # Positive orientable unit clauses : 65 0.34/0.61 # Positive unorientable unit clauses: 6 0.34/0.61 # Negative unit clauses : 5 0.34/0.61 # Non-unit-clauses : 283 0.34/0.61 # Current number of unprocessed clauses: 3246 0.34/0.61 # ...number of literals in the above : 8567 0.34/0.61 # Current number of archived formulas : 0 0.34/0.61 # Current number of archived clauses : 337 0.34/0.61 # Clause-clause subsumption calls (NU) : 46987 0.34/0.61 # Rec. Clause-clause subsumption calls : 22246 0.34/0.61 # Non-unit clause-clause subsumptions : 200 0.34/0.61 # Unit Clause-clause subsumption calls : 137 0.34/0.61 # Rewrite failures with RHS unbound : 0 0.34/0.61 # BW rewrite match attempts : 220 0.34/0.61 # BW rewrite match successes : 124 0.34/0.61 # Condensation attempts : 975 0.34/0.61 # Condensation successes : 0 0.34/0.61 # Termbank termtop insertions : 105154 0.34/0.61 0.34/0.61 # ------------------------------------------------- 0.34/0.61 # User time : 0.162 s 0.34/0.61 # System time : 0.011 s 0.34/0.61 # Total time : 0.173 s 0.34/0.61 # Maximum resident set size: 3816 pages 0.34/0.61 0.34/0.61 # ------------------------------------------------- 0.34/0.61 # User time : 0.170 s 0.34/0.61 # System time : 0.013 s 0.34/0.61 # Total time : 0.183 s 0.34/0.61 # Maximum resident set size: 2104 pages 0.34/0.61 EOF